$h$-Polynomials of Reduction Trees
نویسندگان
چکیده
منابع مشابه
Tutte polynomials for trees
We define two two-variable polynomials for rooted trees and one twovariable polynomial for unrooted trees, all of which are based on the coranknullity formulation of the Tutte polynomial of a graph or matroid. For the rooted polynomials, we show that the polynomial completely determines the rooted tree, i.e., rooted trees TI and T, are isomorphic if and only if f(T,) = f(T2). The corresponding ...
متن کاملDistance Matrix Polynomials of Trees
Let G be a finite connected graph. If x and y are vertices of G, one may define a distance function d, on G by letting d&x, y) be the minimal length of any path between x and y in G (with d&, x) = 0). Thus, for example, d&x, y) = 1 if and only if {x, y} is an edge of G. Furthermore, we define the distance matrix D(G) for G to be the square matrix with rows and columns indexed by the vertex set ...
متن کاملImmanantal Polynomials of Laplacian Matrix of Trees
The immanant d () associated with the irreducible character of the symmetric group S n , indexed by the partition of n, acting on an nn matrix A = a ij ] is deened by d (A) = X 2Sn () n Y i=1 a ii(i) : For a tree T on n vertices, let L(T) denote its Laplacian matrix. Let x be an indeterminate variable and I be the n n identity matrix. The immanantal polynomial of T corresponding to d is deened ...
متن کاملPartitions, Kostka Polynomials and Pairs of Trees
Bennett et al. [2] presented a recursive algorithm to create a family of partitions from one or several partitions. They were mainly interested in the cases when we begin with a single square partition or with several partitions with only one part. The cardinalities of those families of partitions are the Catalan and ballot numbers, respectively. In this paper we present a non-recursive descrip...
متن کاملPolynomials for classification trees and applications
This paper relates computational commutative algebra to tree classification with binary covariates. With a single classification variable, properties of uniqueness of a tree polynomial are established. In a binary multivariate context, it is shown how trees for many response variables can be made into a single ideal of polynomials for computations. Finally, a new sequential algorithm is propose...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2016
ISSN: 0895-4801,1095-7146
DOI: 10.1137/140987882